A Model for Bus Crew Scheduling Problem with Multiple Duty Types
نویسندگان
چکیده
This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty e.g., day duty has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew scheduling at the minimum expense of total idle time of crew for a circle bus line. Correspondingly, a heuristic algorithm utilizing the tabu search algorithm has been proposed to solve the model. Finally, the proposed model and algorithm are successfully tested by a case study.
منابع مشابه
Two Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملA Comprehensive Approach for Railway Crew Scheduling Problem (Case Study: Iranian Railway Network)
The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...
متن کاملIntegrated Vehicle Routing and Crew Scheduling (IVRCS) in Waste Management Part II
Waste management involves an efficient planing of collectionvehicles and corresponding crews. We present an optimization model and algorithm for the crew scheduling problem which is the second part of an integrative solution approach. We differentiate between a network based duty generation phase and a duty optimization phase where an optimal set of annual duties for all employees is selected.
متن کاملCrew Scheduling Considering Both Crew Duty Time Difference and Cost on Urban Rail System
Urban rail crew scheduling problem is to allocate train services to crews based on a given train timetable while satisfying all the operational and contractual requirements. In this paper, we present a new mathematical programming model with the aim of minimizing both the related costs of crew duty and the variance of duty time spreads. In addition to iincorporating the commonly encountered cre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014